搜索资源列表
N-Queens
- 此N皇后问题更具通用性,虽然在N=16时运行时间过长,但是还是有意义的。
queenn(N皇后问题)
- 在一个N×N的国际象棋棋盘中摆N个皇后,使这N个皇后不能互相被对方吃掉。-in an N N chess board wavers N Queen so that the N-Queens that can be eaten by the other side.
N皇后问题
- 在一个N×N的国际象棋棋盘中摆N个皇后,使这N个皇后不能互相被对方吃掉。-Put on N queens in a N multiply N chessboard,preventing each queen to be knocked over
AN EXPERIMENTAL TABU SEARCH CODE FOR THE N-QUEENS PROBLEM
- * TSQUEEN.C : <n> number of queens * * <tabu_size> size of the tabu list * * <max_iter> maximum number of iterations * *
nqueens(localSearch)
- n皇后问题,采用局部搜索算法,普通搜索效率,内含代码。-n queens problem, using a local search algorithm, general search efficiency, containing the code.
N-Queen
- : N皇后问题,在一个N×N国际象棋盘 上,有N个皇后,每个皇后占一格;要求皇后间不会出现 相互“攻击”的现象,即不能有两个皇后处在同一行、同一 列或同一对角线上。问共有多少种不同的方法。下图以4 个皇后为例,说明一个正确的解( N是一个大于等于2并 且小于等于100的整数)-: N queens problem, a NN chess disk, N-Queen, Queen of the grid requirements between each other &quo
Queen
- 求解n皇后问题的MATLAB源程序。此程序只需输入皇后个数,即可得到所有的解。-N queens problem solving MATLAB source code. Just enter the number of this program at Queen' s, you can get all of the solution.
Nqueens
- N皇后问题,N由自己输入的值来确定,然后输出所有皇后摆放的方法-N queens problem, N by their own input values to determine, and then display the output all the way to Queen' s
n-queens-mm
- c实现n皇后m棋盘, c实现n皇后m棋盘, -c realization of n
NQueenProblem
- 这是一个自己实现的N皇后问题c++解法,请各位指教-This is an own implementation of the N Queens problem c++ solution
nqueenproblem
- This program finds the locations of placing n queens in a n*n chessboard so that none attack any other
N_Queens
- The N queens puzzle is the problem of putting N chess queens on an n×n chessboard such that none of them is able to capture any other using the standard chess queen s moves. The queens must be placed in such a way that no queens would be
n_queen_problem
- 在VC6.0环境下实现的n皇后问题,供需要的朋友参考-In the VC6.0 environment to achieve n-queens problem, for a friend in need for reference
queens
- 一个使用greedy search算法实现的N个queen排列的程序。用星号代表国际象棋中的queen。随机生成布局后,显示每次移动,最后使queen不能互相攻击。即都不在相同的行,列和对角线。-A greedy search algorithm using the N-a queen arranged procedure. Behalf of the international chess with an asterisk in the queen. Randomly generated la
NQueen
- N皇后问题的爬山法 效果比普通方法好一些-N queens problem of hill-climbing method is better than the average effect of
nwanghou
- 算法分析,N皇后问题,这是上交的作业,准确无误!-Algorithm analysis, N queens problem
n-queens
- n-queen,s problem with php and ajax source code.
NQueen
- n皇后问题可以表示成n-元组(x1,…,xn),其中xi是放在第i行的皇后所在的列号。于是,解空间由nn个n-元组组成。 显示约束条件为Si={1,2,…….,n},1 i n。 隐式约束条件之一为没有两个xi相同(即任意两个皇后不在同一列上)。将其加入到显式条件中,于是解空间的大小由nn个元组减少到n!个元组。 -n queens problem can be expressed as n-tuple (x1, ..., xn), where xi i
Queens-java.tar
- A recursive implementation to solve the n-queens problem, in Java.
queens.c.tar
- linux平台下利用curse库N 皇后问题解决方案-The famous N-Queens Solver